|
QA9.59 .H36 1999
|
Handbook of computability theory / |
1 |
|
QA9.59 .K46 1982
|
A programming approach to computability / |
1 |
|
QA9.59 .M25 1984
|
Computability with PASCAL / |
1 |
|
QA9.59 .M35
|
Elementary computability, formal languages, and automata / |
1 |
|
QA9.59 .P68 1989
|
Computability in analysis and physics / |
1 |
|
QA9.59 R39 1986
|
A first course in computability / |
1 |
|
QA9.59 .W67 1987
|
Logic and computation : proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 / |
1 |
|
QA9.59 ǂb .W67 1987eb
|
Logic and Computation |
1 |
|
QA9.6 .B73 1988
|
Algorithmics : theory and practice / |
1 |
|
QA9.6 .C46 2015
|
Recursion theory : computational aspects of definability / |
1 |
|
QA9.6 .C49
|
Techniques of admissible recursion theory / |
1 |
|
QA9.6 .C66 1996
|
Computability, enumerability, unsolvability : directions in recursion theory / |
1 |
|
QA9.6 .E6
|
Initial segments of degrees below 0' / |
1 |
|
QA9.6 .E67 1981eb
|
Initial segments of degrees below 0' / |
1 |
|
QA9.6 .F57 1981
|
Fundamentals of generalized recursion theory / |
1 |
|
QA9.6 .G74 2006
|
The role of true finiteness in the admissible recursively enumerable degrees / |
1 |
|
QA9.6 .K53 1978
|
The Kleene Symposium : proceedings of the symposium held June 18-24, 1978 at Madison, Wisconsin, U.S.A. / |
1 |
|
QA9.6 .M34 1982
|
Regressive sets and the theory of isols / |
1 |
|
QA 9.6 N6
|
Recursion on the countable functionals / |
1 |
|
QA9.6 .O35 1989
|
Classical recursion theory : the theory of functions and sets of natural numbers / |
1 |